Robust Counterpart Open Capacitated Vehicle Routing (RC-OCVRP) Model in Optimization of Garbage Transportation in District Sako and Sukarami, Palembang City

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A particle swarm optimization method for periodic vehicle routing problem with pickup and delivery in transportation

In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...

متن کامل

Particle Swarm Optimization In Solving Capacitated Vehicle Routing Problem

The Capacitated Vehicle Routing Problem (CVRP) is a NP – Complete problem and according to this definition there is no exact solution for it. So researchers try to achieve a near optimum solution for it, by using meta – heuristic algorithms. The aim of CVRP is to find optimum route for every vehicle as a sequence of customers, that vehicle served. We employ Particle Swarm Optimization to solve ...

متن کامل

On Capacitated Vehicle Routing

We consider the capacitated vehicle routing problem (VRP): a fixed fleet of delivery vehicles of uniform capacity must service at minimal transit cost from a common depot known customer demand for a single commodity. This problem is modeled as a side-constrained traveling salesman problem (TSP). Among the additional constraints are the vehicle capacity restrictions, analogous to TSP subtour eli...

متن کامل

robust optimization model for locating and capacitated hub covering problem

in this paper, a robust model presented is developed for hub covering flow problem in which hubs have capacity. this problem has two objective functions converting to a single-objective problem by using weighting method. firstly, the problem will be formulated in a certain case. then, by considering the demand as a non-random variable, it will be modeled by robust optimization. finally, by usin...

متن کامل

The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty

We study the robust capacitated vehicle routing problem (CVRP) under demand uncertainty, which determines a minimum cost delivery of a product to geographically dispersed customers using capacity-constrained vehicles. Contrary to the deterministic CVRP, which postulates that the customer demands for the product are deterministic and known, the robust CVRP models the customer demands as random v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Electrical and Computer Engineering (IJECE)

سال: 2018

ISSN: 2088-8708,2088-8708

DOI: 10.11591/ijece.v8i6.pp4382-4390